On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees

A surprising result of Bokal et al. proved that the exact minimum value c such c-crossing-critical graphs do not have bounded maximum degree is \(c=13\). The key to an inductive construction a family 13-crossing-critical with many vertices arbitrarily high degrees. While part rather easy, it all relies on fact certain 17-vertex base graph has crossing number 13, which was originally verified only by machine-readable computer proof. We now provide relatively short self-contained computer-free